A Status Report on the P Versus NP Question
نویسنده
چکیده
We survey some of the history of the most famous open question in computing: the P versus NP question. We summarize some of the progress that has been made to date, and assess the current situation.
منابع مشابه
On the P versus NP intersected with co-NP question in communication complexity
We consider the analog of the P versus NP∩ co-NP question for the classical two-party communication protocols where polynomial time is replaced by poly-logarithmic communication: if both a boolean function f and its negation ¬f have small (poly-logarithmic in the number of variables) nondeterministic communication complexity, what is then its deterministic and/or probabilistic communication com...
متن کاملA Personal View of the P versus NP Problem
I recently completed a general audience book on the P versus NP problem [1]. Writing the book has forced me to step back and take a fresh look at the question from a non-technical point of view. There are really two different P versus NP problems. One is the formal mathematical question, first formulated by Steve Cook in 1971 [2] and listed as one of the six unresolved millennium problems by th...
متن کاملHealth and Loneliness Status of the Elderly Living in Nursing Homes Versus Those Living with Their Families
Objectives: As attention of the elderly is progressing rapidly in developing countries in recent years, special attention to their mental and physical needs are necessary. The aim of this study was to comparing general health and loneliness between two groups of the elderly, one who live with their families versus those who live in nursing homes in north part of Tehran, Iran. Methods & Mater...
متن کاملOn the possibility of basing Cryptography on the assumption that P ≠ NP
Recent works by Ajtai and by Ajtai and Dwork bring to light the old (general) question of whether it is at all possible to base the security of cryptosystems on the assumption that P 6 = NP. We discuss this question and in particular review and extend a two-decade old result of Brassard regarding this question. Our conclusion is that the question remains open.
متن کاملAlchemistry of the P versus NP question
Are P and NP provably inseparable ? Take a look at some unorthodox, guilty mentioned folklore and related unpublished results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Advances in Computers
دوره 77 شماره
صفحات -
تاریخ انتشار 2009